Cayley graph on symmetric group generated by elements fixing k points
نویسندگان
چکیده
منابع مشابه
On Cayley Graphs on the Symmetric Group Generated by Tranpositions
Given a connected graph, X, we denote by λ2 = λ2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n − 1 transpositions which generate the symmetric group, Sn, the set whose associated Cayley graph has the highest λ2 is the set {(1, n), (2, n), . . . , (n− 1, n)} (or the same with n and i exchanged for any i < n). For this set we have λ2 = 1. This resul...
متن کاملCayley Graphs on the Symmetric Group Generated by Initial Reversals have Unit Spectral Gap
In a recent paper Gunnells, Scott and Walden have determined the complete spectrum of the Schreier graph on the symmetric group corresponding to the Young subgroup Sn−2 × S2 and generated by initial reversals. In particular they find that the first nonzero eigenvalue, or spectral gap, of the Laplacian is always 1, and report that “empirical evidence” suggests that this also holds for the corres...
متن کاملOn the automorphism group of Cayley graphs generated by transpositions
The modified bubble-sort graph of dimension n is the Cayley graph of Sn generated by n cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension n is Sn × D2n, for all n ≥ 5. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct produ...
متن کاملOn the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
Given a finite simple graph G with n vertices, we can construct the Cayley graph on the symmetric group Sn generated by the edges of G , interpreted as transpositions. We show that, if G is complete multipartite, the eigenvalues of the Laplacian of Cay(G ) have a simple expression in terms of the irreducible characters of transpositions and of the Littlewood–Richardson coefficients. As a conseq...
متن کاملcharacterization of the symmetric group by its non-commuting graph
the non-commuting graph $nabla(g)$ of a non-abelian group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we 'll prove that if $g$ is a finite group with $nabla(g)congnabla(bs_{n})$, then $g cong bs_{n}$, where $bs_{n}$ is the symmetric group of degre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.01.006